A simple procedure for generating locally refined 2D quadrilateral finite element meshes of gears

نویسندگان

چکیده

This article describes a new procedure for automated generation of two-dimensional locally refined quadrilateral meshes gear drives. In this procedure, base mesh is generated using multiblock meshing procedure. Then, selected elements the are subdivided to obtain in certain parts teeth. The proposed completed with quality enhancement technique, which based on an optimization-based smoothing. It also includes strategies that allow automatically identify and refine those areas typically subjected elevated stress gradients. performance illustrated numerical examples, it compared other existing procedures, both terms distortion accuracy results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

“CleanUp: Improving Quadrilateral Finite Element Meshes”

Unless an all quadrilateral (quad) finite element mesher is of a high quality, the mesh it produces can contain misshapen quads. This paper will describe “CleanUp”, written to improve an all quad mesh. CleanUp looks at improving node connectivity, boundary and flange patterns, quad shape, and to some extent, quad size. CleanUp is currently used in conjunction with the Paver algorithm developed ...

متن کامل

A Simple Finite Element Procedure for Free Vibration and Buckling Analysis of Cracked Beam-Like Structures

In this study, a novel and very simple finite element procedure is presented for free vibration and buckling analysis of slim beam-like structures damaged by edge cracks. A cracked region of a beam is modeled using a very short element with reduced second moment of area (I). For computing reduced I in a cracked region, the elementary theory of bending of beams and local flexibility approach are...

متن کامل

Multigrid for Locally Refined Meshes

A two-level method for the solution of nite element schemes on locally reened meshes is introduced. The upper bound on the condition number implies, in some cases, mesh-independent convergence, as is veriied numerically for a diiusion problem with discontinuous coeecients. The discontinuity curves are not necessarily aligned with the coarse mesh; indeed, numerical applications with ten levels o...

متن کامل

Discrete extension operators for mixed finite element spaces on locally refined meshes

The existence of uniformly bounded discrete extension operators is established for conforming Raviart-Thomas and Nédelec discretisations of H(div) and H(curl) on locally refined partitions of a polyhedral domain into tetrahedra.

متن کامل

Convergence of an adaptive finite element method on quadrilateral meshes

We prove convergence and optimal complexity of an adaptive finite element algorithm on quadrilateral meshes. The local mesh refinement algorithm is based on regular subdivision of marked cells, leading to meshes with hanging nodes. In order to avoid multiple layers of these, a simple rule is defined, which leads to additional refinement. We prove an estimate for the complexity of this refinemen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mechanism and Machine Theory

سال: 2021

ISSN: ['1873-3999', '0094-114X']

DOI: https://doi.org/10.1016/j.mechmachtheory.2020.104185